Optimal Time Broadcasting in Faulty Star Networks

This paper investigates fault-tolerant broadcasting in star networks. We propose a non-adaptive single-port broadcasting scheme in the n-star network such that it tolerates n 2 faults in the worst case and completes the broadcasting in O(n log n) time. The existence of such a broadcasting scheme was not known before. A new technique, called di using-and-disseminating, is introduced into the scheme. This technique is useful to overcome the di culty due to the special topology of star networks. We also analyze the reliability of the broadcasting scheme in the case where faults are randomly distributed in the n-star network. We show that the broadcasting scheme in the n-star network can tolerate (n!) random faults with a high probability, where is any constant less than 1.